首页> 外文OA文献 >A Computational Complexity Analysis of an Algorithm for Reliability Optimization
【2h】

A Computational Complexity Analysis of an Algorithm for Reliability Optimization

机译:可靠性优化算法的计算复杂度分析

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Least-cost allocation of redundancy within subsystems of a series-parallel system to meet a requirement for system reliability may be modelled as a nonlinear integer program in which the number of variables is equal to the number of subsystems. The data are the system requirement, the reliabilities of the identical components within each subsystem and the costs of these components. The model has a linear cost function as its objective and a single non-linear constraint that enforces the requirement for system reliability. The continuous counterpart of the discrete problem can be solved by solving a polynomial equation. The main result of this paper is a bound on the effort required to obtain from the solution of the continuous relaxation the optimal numbers of redundant components for the subsystems.
机译:满足系统可靠性要求的串联-并联系统的子系统中冗余的最低成本分配可以建模为非线性整数程序,其中变量的数量等于子系统的数量。数据是系统要求,每个子系统中相同组件的可靠性以及这些组件的成本。该模型以线性成本函数为目标,并具有单个非线性约束,该约束对系统可靠性提出了要求。离散问题的连续对应项可以通过求解多项式方程来解决。本文的主要结果是从持续松弛的解决方案中获得子系统冗余组件的最佳数量所需的努力范围。

著录项

  • 作者

    Nmah, Benedict K;

  • 作者单位
  • 年度 2015
  • 总页数
  • 原文格式 PDF
  • 正文语种
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号